fixed algorithm - vertaling naar russisch
Diclib.com
Woordenboek ChatGPT
Woordenboek opzoeken Oplossingen op maat
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie
  1. Woordenboeken
  2. Engels-Russisch woordenboek
  3. fixed algorithm

fixed algorithm - vertaling naar russisch

ROOT-FINDING ALGORITHM
Picard iteration; Fixpoint iteration; Fixpoint algorithm; Fixed point algorithm; Fixed point method; Fixed point iteration method; Fixed point iteration
  • 1=''x''<sub>1</sub> = −1}}.
  • Sierpinski triangle created using IFS, selecting all members at each iteration
  • 1=''x''<sub>0</sub> = 2}} converges to 0. This example does not satisfy the assumptions of the [[Banach fixed-point theorem]] and so its speed of convergence is very slow.

fixed algorithm      
постоянный алгоритм
algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650 <syntaxhighlight lang="text" highlight="1,5"> 1599 = 650×2 + 299 650 = 299×2 + 52 299 = 52×5 + 39 52 = 39×1 + 13 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus
algorithm noun math. алгоритм algorithm validation - проверка правильности алгоритма
algorithmic method         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650 <syntaxhighlight lang="text" highlight="1,5"> 1599 = 650×2 + 299 650 = 299×2 + 52 299 = 52×5 + 39 52 = 39×1 + 13 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus

математика

алгоритмический метод

Definitie

fixed costs
¦ plural noun business costs, such as rent, that are constant whatever the amount of goods produced.
Toon meer definities

Wikipedia

Fixed-point iteration

In numerical analysis, fixed-point iteration is a method of computing fixed points of a function.

More specifically, given a function f {\displaystyle f} defined on the real numbers with real values and given a point x 0 {\displaystyle x_{0}} in the domain of f {\displaystyle f} , the fixed-point iteration is

which gives rise to the sequence x 0 , x 1 , x 2 , … {\displaystyle x_{0},x_{1},x_{2},\dots } of iterated function applications x 0 , f ( x 0 ) , f ( f ( x 0 ) ) , … {\displaystyle x_{0},f(x_{0}),f(f(x_{0})),\dots } which is hoped to converge to a point x fix {\displaystyle x_{\text{fix}}} . If f {\displaystyle f} is continuous, then one can prove that the obtained x fix {\displaystyle x_{\text{fix}}} is a fixed point of f {\displaystyle f} , i.e.,

More generally, the function f {\displaystyle f} can be defined on any metric space with values in that same space.

https://en.wikipedia.org/wiki/Fixed-point iteration
Vertaling van &#39fixed algorithm&#39 naar Russisch
Woordenboek opzoeken
Alle woordenboeken Arabisch woordenboek Duits woordenboek Engels woordenboek Engels-Arabisch woordenboek Engels-Duits woordenboek Engels-Frans woordenboek Engels-Grieks woordenboek Engels-Italiaans woordenboek Engels-Nederlands woordenboek Engels-Russisch woordenboek Engels-Spaans woordenboek Frans woordenboek Frans-Russisch woordenboek Grieks woordenboek Italiaans woordenboek Italiaans-Russisch woordenboek Latijn-Portugees woordenboek Nederlands woordenboek Portugees woordenboek Portugees-Russisch woordenboek Russisch woordenboek Spaans woordenboek Woordenboek Latijn-Spaans
AI-gegenereerd
Engels Russisch Spaans Portugees Duits Frans Grieks Nederlands Italiaans Arabisch
Interfacetaal
Русский English Español Português Deutsch Français Ελληνικά Nederlands Italiano عربي
Contacten
Neem contact met ons op



Privacy
Privacybeleid